#include <bits/stdc++.h>
using namespace std;

const int N = 1e5+5;
int n, r[N], ma, ans;
bitset<N> w;

signed main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    freopen("duel.in", "r", stdin);
    freopen("duel.out", "w", stdout);
    cin >> n;
    for (int i = 1; i <= n; ++i) cin >> r[i];
    sort(r+1, r+n+1);
    int l = 1, left = 0;
    for (int i = 2; i <= n+1; ++i) {
        if (r[i] != r[i-1]) {
            int len = i-l;
            if (len > left) ans+=left, left = len;
            else ans+=len, left = left;
            l = i;
        }
    }
    cout << n-ans << "\n";
    return 0;
}